Rainbow Hamilton cycles in random regular graphs
نویسندگان
چکیده
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n→∞, for fixed d ≥ 8.
منابع مشابه
A ug 2 00 5 RAINBOW HAMILTON CYCLES IN RANDOM REGULAR GRAPHS SVANTE JANSON
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n → ∞, provided d ≥ 8.
متن کاملA ug 2 00 5 RAINBOW HAMILTON CYCLES IN RANDOM REGULAR GRAPHS
A rainbow subgraph of an edge-coloured graph has all edges of distinct colours. A random d-regular graph with d even, and having edges coloured randomly with d/2 of each of n colours, has a rainbow Hamilton cycle with probability tending to 1 as n → ∞, provided d ≥ 8.
متن کاملA Brief Introduction to Hamilton Cycles in Random Graphs
We survey results concerning Hamilton cycles in random graphs. Specifically, we focus on existence results for general and regular graphs, and discuss algorithms for finding Hamilton cycles and solving related problems (that succeed with high probability).
متن کاملClosing Gaps in Problems related to Hamilton Cycles in Random Graphs and Hypergraphs
We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graphs and hypergraphs. In particular, we firstly show that for k > 3, if pnk−1/ log n tends to infinity, then a random k-uniform hypergraph on n vertices, with edge probability p, with high probability (w.h.p.) contains a l...
متن کاملRainbow hamilton cycles in random graphs
One of the most famous results in the theory of random graphs establishes that the threshold for Hamiltonicity in the Erdős-Rényi random graph Gn,p is around p ∼ logn+log logn n . Much research has been done to extend this to increasingly challenging random structures. In particular, a recent result by Frieze determined the asymptotic threshold for a loose Hamilton cycle in the random 3-uniform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 30 شماره
صفحات -
تاریخ انتشار 2007